Alternating paths revisited II: restricted b-matchings in bipartite graphs
نویسنده
چکیده
We give a constructive proof for a min-max relation on restricted b-matchings in bipartite graphs, extending results of Hartvigsen [5, 6], Király [7], and Frank [3]. Restricted b-matching is a special case of covering pairs of sets, for which Benczúr and Végh [1, 2] constructed a polynomial time algorithm – this implies a polynomial time algorithm for restricted b-matchings, as well. In this paper we solve restricted b-matchings directly, in a conceptually simple way.
منابع مشابه
Controllability and matchings in random bipartite graphs
Motivated by an application in controllability we consider maximum matchings in random bipartite graphs G = (A,B). First we analyse Karp–Sipser’s algorithm to determine the asymptotic size of maximum matchings in random bipartite graphs with a fixed degree distribution. We then allow an adversary to delete one edge adjacent to every vertex in A in the more restricted model where each vertex in ...
متن کاملLectures 4 and 5 – Matchings
A matching in a graph is a set of edges, no two of which share an endpoint. We describe Edmond’s algorithm for finding matchings of maximum cardinality in a graph. For bipartite graphs with edge weights, we also show how to find matchings of maximum weight. It is recommended that the reader draws pictures of the various constructs that we use (such as alternating trees). I was too lazy to incor...
متن کاملCoverings, matchings and paired domination in fuzzy graphs using strong arcs
The concepts of covering and matching in fuzzy graphs using strong arcs are introduced and obtained the relationship between them analogous to Gallai’s results in graphs. The notion of paired domination in fuzzy graphs using strong arcs is also studied. The strong paired domination number γspr of complete fuzzy graph and complete bipartite fuzzy graph is determined and obtained bounds for the s...
متن کاملRamsey and Turán-type problems for non-crossing subgraphs of bipartite geometric graphs
Geometric versions of Ramsey-type and Turán-type problems are studied in a special but natural representation of bipartite graphs and similar questions are asked for general representations. A bipartite geometric graphG(m,n) = [A,B] is simple if the vertex classes A,B of G(m,n) are represented in R2 as A = {(1, 0), (2, 0), . . . , (m, 0)}, B = {(1, 1), (2, 1), . . . , (n, 1)} and the edge ab is...
متن کاملThe Rotation Graphs of Perfect Matchings of Plane Bipartite Graphs
In the present paper, the minimal proper alternating cycle (MPAC) rotation graph R(G) of perfect matchings of a plane bipartite graph G is defined. We show that an MPAC rotation graph R(G) of G is a directed rooted tree, and thus extend such a result for generalized polyhex graphs to arbitrary plane bipartite graphs. As an immediate result, we describe a one-to-one correspondence between MPAC s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005